This edited book focuses on non-classical logics and their applications, highlighting the rapid advances and the new perspectives that are emerging in this area. Non-classical logics are logical formalisms that violate or go beyond classical logic laws, and their specific features make them particularly suited to describing and reason about aspects of social interaction. The richness and diversity of non-classical logics mean that this area is a natural catalyst for ideas and insights from many different fields, from information theory (...) to game theory and business science. This volume is the post-proceedings of the 8th International Conference on Logic and Cognition, held at Sun Yat-Sen University Institute of Logic and Cognition in Guangzhou, China in December 2016. The conference series started in 2001, and is organized by the ILC, often in collaboration with various international research groups. This eighth installment was jointly organized by ILC and Alessandra Palmigiano's Applied Logic research group. The conference series aims to foster the development of effective logical tools to study social behavior from a philosophical, cognitive and formal perspective in order to challenge the field of logic in ways that open up new and exciting research directions. Chapter "The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms" of this book is available open access under a CC BY 4.0 license at link.springer.com. (shrink)

In this article, a qualitative notion of subjective plausibility and its revision based on a preorder relation are implemented in higher-order logic. This notion of plausibility is used for modeling pragmatic aspects of communication on top of traditional two-dimensional semantic representations.

This volume presents a collection of refereed papers reflecting the state of the art in the area of over-constrained systems. Besides 11 revised full papers, selected from the 24 submissions to the OCS workshop held in conjunction with the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Marseilles in September 1995, the book includes three comprehensive background papers of central importance for the workshop papers and the whole field. Also included is (...) an introduction by one of the volume editors together with a bibliography listing 243 entries. All in all this is a very useful reference book relevant for all researchers and practitioners interested in hierarchical, partial, and over-constrained systems. (shrink)

"The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint (...) class='Hi'>logic programming, search-space pruning and universal algebra, and implementation on transputer networks."--PUBLISHER'S WEBSITE. (shrink)

Internal sets and the Boolean algebras of the collection of the internal sets are of central importance in non-standard analysis. Boolean algebras are the algebraization of propositional logic while the logic applied in non-standard analysis (in non-standard stochastics) is the first order or the higher order logic (type theory). We present here a first order logic algebraization for the collection of internal sets rather than the Boolean one. Further, we define an unusual (...) probability on this algebraization. (shrink)

This is the first comprehensive textbook on higher order logic that is written specifically to introduce the subject matter to graduate students in philosophy. The book covers both the formal aspects of higher-order languages -- their model theory and proof theory, the theory of λ-abstraction and its generalizations -- and their philosophical applications, especially to the topics of modality and propositional granularity. The book has a strong focus on non-extensional higher-order logics, making it (...) more appropriate for foundational metaphysics than other introductions to the subject from computer science, mathematics, and linguistics. A Philosophical Introduction to Higher Order Logics assumes only that readers have a basic knowledge of first-order logic. With an emphasis on exercises, it can be used as a textbook though is also ideal for self-study. Author Andrew Bacon organizes the book's 18 chapters around four main parts: I. Typed Language II. Higher Order Languages III. General Higher-Order Languages IV. Higher-Order Model Theory In addition, two appendices cover the Curry-Howard isomorphism and its applications for modeling propositional structure. Each chapter includes exercises that move from easier to more difficult, strategically placed throughout the chapter, and concludes with an annotated suggested reading list providing graduate students with most valuable additional resources. Key Features Is the first comprehensive introduction to higher-order logic as a grounding for addressing problems in metaphysics Introduces the basic formal tools that are needed to theorize in, and model, higher order languages Offers an abundance of: - Simple exercises throughout the book, serving as comprehension checks on basic concepts and definitions - More difficult exercises designed to facilitate long-term learning Contains annotated sections on further reading, pointing the reader to related literature, learning resources, and historical context. (shrink)

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, (...) Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others. (shrink)

This paper deals with higher-order vagueness in Williamson's 'logic of clarity'. Its aim is to prove that for 'fixed margin models' (W,d,α ,[ ]) the notion of higher-order vagueness collapses to second-order vagueness. First, it is shown that fixed margin models can be reformulated in terms of similarity structures (W,~). The relation ~ is assumed to be reflexive and symmetric, but not necessarily transitive. Then, it is shown that the structures (W,~) come along with (...) naturally defined maps h and s that define a Galois connection on the power set PW of W. These maps can be used to define two distinct boundary operators bd and BD on W. The main theorem of the paper states that higher-order vagueness with respect to bd collapses to second-order vagueness. This does not hold for BD, the iterations of which behave in quite an erratic way. In contrast, the operator bd defines a variety of tolerance principles that do not fall prey to the sorites paradox and, moreover, do not always satisfy the principles of positive and negative introspection. (shrink)

Let $R$ be a convergent term rewriting system, and let $CR$-equality on combinatory logic terms be the equality induced by $\beta \eta R$-equality on terms of the lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates $CR$-equality and whose irreducibles are exactly the translates of long $\beta R$-normal forms. The classical notion of strong normal form (...) in combinatory logic is also generalized, yielding yet another description of these translates. Their resulting tripartite characterization extends to the combined first-order algebraic and higher-order setting the classical combinatory logic descriptions of the translates of long $\beta$-normal forms in the lambda calculus. As a consequence, the translates of long $\beta R$-normal forms are easily seen to serve as canonical representatives for $CR$-equivalence classes of combinatory logic terms for non-empty, as well as for empty, $R$. (shrink)

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E. In contrast to the well-known interpretation of higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE, but rather by a suitable complete Heyting algebra H. The canonical map relating H and ΩE both serves to interpret equality and provides a modal operator on H in the form of a comonad. Examples of (...) such structures arise from surjective geometric morphisms f : F → E, where H = f∗ΩF. The logic differs from non-modal higher-order logic in that the principles of functional and propositional extensionality are not longer valid but may be replaced by modalized versions. The usual Kripke, neighborhood, and sheaf semantics for propositional and first-order modal logic are subsumed by this notion. (shrink)

In this paper a proposal by Henkin of a nominalistic interpretation for second and higher-order logic is developed in detail and analysed. It was proposed as a response to Quine’s claim that second and higher-order logic not only are committed to the existence of sets, but also are committed to the existence of more sets than can ever be referred to in the language. Henkin’s interpretation is rarely cited in the debate on semantics and (...) ontological commitments for these logics, though it has many interesting ideas that are worth exploring. The detailed development will show that it employs an early strategy of using substitutional quantification in order to reduce ontological commitments. It will be argued that the perspective adopted for the predicate variables renders it a natural extension of Quine’s nominalistic interpretation for first-order logic. However, we will argue that, with respect to Quine’s nominalistic program and his notion of ontological commitment, still holds and thus Henkin’s interpretation is not nominalistic. Nevertheless, it will be seen that is addressed successfully and this provides further insights on the so-called “Skolem Paradox”. Moreover, the interpretation is ontologically parsimonious and, in this respect, it arguably fares better than a recent proposal by Bob Hale. (shrink)

Subverting a once widely held Quinean paradigm, there is a growing consensus among philosophers of logic that higher-order quantifiers (which bind variables in the syntactic position of predicates and sentences) are a perfectly legitimate and useful instrument in the logico-philosophical toolbox, while neither being reducible to nor fully explicable in terms of first-order quantifiers (which bind variables in singular term position). This article discusses the impact of this quantificational paradigm shift on metaphysics, focussing on theories (...) of properties, propositions, and identity, as well as on the metaphysics of modality. (shrink)

Higher-order logic augments first-order logic with devices that let us generalize into grammatical positions other than that of a singular term. Some recent metaphysicians have advocated for using these devices to raise and answer questions that bear on many traditional issues in philosophy. In contrast to these 'higher-order metaphysicians', traditional metaphysics has often focused on parallel, but importantly different, questions concerning special sorts of abstract objects: propositions, properties and relations. The answers to (...) the higher-order and the property-theoretic questions may coincide sometimes but will often come apart. I argue that when they do, the higher-order questions are closer to the metaphysical action and so it would be better for these debates to proceed in higher-order terms. (shrink)

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the `width' of the set theoretic universe, such as Cantor's continuum hypothesis. Within a higher-order framework I show (...) that contingency about the width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the "Leibniz biconditionals" stating that what is possible, in the broadest sense of possible, is what is true in some possible world. Nonetheless, I suggest that the underlying picture of modal set-theory is coherent and has attractions. (shrink)

Two expressive limitations of an infinitary higher-order modal language interpreted on models for higher-order contingentism – the thesis that it is contingent what propositions, properties and relations there are – are established: First, the inexpressibility of certain relations, which leads to the fact that certain model-theoretic existence conditions for relations cannot equivalently be reformulated in terms of being expressible in such a language. Second, the inexpressibility of certain modalized cardinality claims, which shows that in such a (...) language, higher-order contingentists cannot express what is communicated using various instances of talk of ‘possible things’, such as ‘there are uncountably many possible stars’. (shrink)

It is usually taken as given that consciousness involves superior or more elaborate forms of information processing. Contemporary models equate consciousness with global processing, system complexity, or depth or stability of computation. This is in stark contrast with the powerful philosophical intuition that being conscious is more than just having the ability to compute. I argue that it is also incompatible with current empirical findings. I present a model that is free from the strong assumption that consciousness predicts superior performance. (...) The model is based on Bayesian decision theory, of which signal detection theory is a special case. It reflects the fact that the capacity for perceptual decisions is fundamentally limited by the presence and amount of noise in the system. To optimize performance, one therefore needs to set decision criteria that are based on the behaviour, i.e. the probability distributions, of the internal signals. One important realization is that the knowledge of how our internal signals behave statistically has to be learned over time. Essentially, we are doing statistics on our own brain. This ‘higherorder’ learning, however, may err, and this impairs our ability to set and maintain optimal criteria for perceptual decisions, which I argue is central to perception consciousness. I outline three possibilities of how conscious perception might be affected by failures of ‘higher-order’ representation. These all imply that one can have a dissociation between consciousness and performance. This model readily explains blindsight and hallucinations in formal terms, and is beginning to receive direct empirical support. I end by discussing some philosophical implications of the model. (shrink)

The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first- (...) class='Hi'>order terms, since it has to take the theory of αβη-equality into account. As a consequence, the higher-order unification problem is undecidable and sets of solutions need not even always have most general elements that represent them. Thus the mentioned calculi for higher-order logic have take special measures to circumvent the problems posed by the theoretical complexity of higher-order unification. In this paper, we will exemplify the methods and proof- and model-theoretic tools needed for extending first-order automated theorem proving to higherorder logic. For the sake of simplicity take the tableau method as a basis (for a general introduction to first-order tableaux see part I.1) and discuss the higherorder tableau calculi HT and HTE first presented in [19]. The methods in this paper also apply to higher-order resolution calculi [1, 13, 6] or the higher-order matings method of Peter [3], which extend their first-order counterparts in much the same way. Since higher-order calculi cannot be complete for the standard semantics by Gödel’s incompleteness theorem [11], only the weaker notion of Henkin models [12] leads to a meaningful notion of completeness in higher-order logic. It turns out that the calculi in [1, 13, 3, 19] are not Henkin-complete, since they fail to capture the extensionality principles of higher-order logic. We will characterize the deductive power of our calculus HT (which is roughly equivalent to these calculi) by the semantics of functional Σ-models. To arrive at a calculus that is complete with respect to Henkin models, we build on ideas from [6] and augment HT with tableau construction rules that use the extensionality principles in a goal-oriented way.. (shrink)

The problematic features of Quine's set theories NF and ML are a result of his replacing the higher-order predicate logic of type theory by a first-order logic of membership, and can be resolved by returning to a second-order logic of predication with nominalized predicates as abstract singular terms. We adopt a modified Fregean position called conceptual realism in which the concepts (unsaturated cognitive structures) that predicates stand for are distinguished from the extensions (or (...) intensions) that their nominalizations denote as singular terms. We argue against Quine's view that predicate quantifiers can be given a referential interpretation only if the entities predicates stand for on such an interpretation are the same as the classes (assuming extensionality) that nominalized predicates denote as singular terms. Quine's alternative of giving predicate quantifiers only a substitutional interpretation is compared with a constructive version of conceptual realism, which with a logic of nominalized predicates is compared with Quine's description of conceptualism as a ramified theory of classes. We argue against Quine's implicit assumption that conceptualism cannot account for impredicative concept-formation and compare holistic conceptual realism with Quine's class Platonism. (shrink)

In this paper we describe the Curry-Howard-De Bruijn isomorphism between Higher Order Many Sorted Intuitionistic Predicate Logic PREDω and the type system λPREDω, which can be considered a subsystem of the Calculus of Constructions. The type system is presented using the concept of a Pure Type System, which is a very elegant framework for describing type systems. We show in great detail how formulae and proof trees of the logic relate to types and terms of the (...) type system, respectively. Finally, we discuss some consequences of the isomorphism with respect to the relation between the systems discussed in this paper. (shrink)

Kleene's realizability interpretation for first-order arithmetic was shown by Hyland to fit into the internal logic of an elementary topos, the “Effective topos” . In this paper it is shown, that there is an internal realizability definition in , i.e. a syntactical translation of the internal language of into itself of form “n realizes ” , which extends Kleene's definition, and such that for sentences , the equivalence [harr]n is true in . The internal realizability definition depends on (...) finding separated covers for non-separated objects of . However, for the objects arising in higher-order arithmetic, canonical covers are available, which are definable in higher-order arithmetic. These canonical covers yield “covering axioms”. It is shown that these covering axioms, together with uniformity principles and Extended Church's Thesis, axiomatize a formalized extension of Kleene realizability to a constructive system of higher-order arithmetic. The details are worked out for second and third-order arithmetic, but the method can be extended to any order. As an application, it is shown in the final section that a certain completeness property of the category of “modest sets” can be derived in third-order arithmetic from the realizability axioms. (shrink)

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the ‘width’ of the set theoretic universe, such as Cantor’s continuum hypothesis. Within a higher-order framework I show (...) that contingency about the width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the ‘Leibniz biconditionals’ stating that what is possible, in the broadest sense of _possible_, is what is true in some possible world. Nonetheless, I suggest that the underlying picture of modal set-theory is coherent and has attractions. (shrink)

Existential claims are widely held to be grounded in their true instances. However, this principle is shown to be problematic by arguments due to Kit Fine. Stephan Krämer has given an especially simple form of such an argument using propositional quantifiers. This note shows that even if a schematic principle of existential grounds for propositional quantifiers has to be restricted, this does not immediately apply to a corresponding non-schematic principle in higher-order logic.

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications (...) and thus presents the state of the art in the area. (shrink)

A categorical, higher dimensional algebra and generalized topos framework for Łukasiewicz–Moisil Algebraic–Logic models of non-linear dynamics in complex functional genomes and cell interactomes is proposed. Łukasiewicz–Moisil Algebraic–Logic models of neural, genetic and neoplastic cell networks, as well as signaling pathways in cells are formulated in terms of non-linear dynamic systems with n-state components that allow for the generalization of previous logical models of both genetic activities and neural networks. An algebraic formulation of variable ‘next-state functions’ is (...) extended to a Łukasiewicz–Moisil Topos with an n-valued Łukasiewicz–Moisil Algebraic Logic subobject classifier description that represents non-random and non-linear network activities as well as their transformations in developmental processes and carcinogenesis. The unification of the theories of organismic sets, molecular sets and Robert Rosen’s (M,R)-systems is also considered here in terms of natural transformations of organismal structures which generate higher dimensional algebras based on consistent axioms, thus avoiding well known logical paradoxes occurring with sets. Quantum bionetworks, such as quantum neural nets and quantum genetic networks, are also discussed and their underlying, non-commutative quantum logics are considered in the context of an emerging Quantum Relational Biology. (shrink)

A categorical, higher dimensional algebra and generalized topos framework for Łukasiewicz–Moisil Algebraic–Logic models of non-linear dynamics in complex functional genomes and cell interactomes is proposed. Łukasiewicz–Moisil Algebraic–Logic models of neural, genetic and neoplastic cell networks, as well as signaling pathways in cells are formulated in terms of non-linear dynamic systems with n-state components that allow for the generalization of previous logical models of both genetic activities and neural networks. An algebraic formulation of variable ‘next-state functions’ is (...) extended to a Łukasiewicz–Moisil Topos with an n-valued Łukasiewicz–Moisil Algebraic Logic subobject classifier description that represents non-random and non-linear network activities as well as their transformations in developmental processes and carcinogenesis. The unification of the theories of organismic sets, molecular sets and Robert Rosen’s (M,R)-systems is also considered here in terms of natural transformations of organismal structures which generate higher dimensional algebras based on consistent axioms, thus avoiding well known logical paradoxes occurring with sets. Quantum bionetworks, such as quantum neural nets and quantum genetic networks, are also discussed and their underlying, non-commutative quantum logics are considered in the context of an emerging Quantum Relational Biology. (shrink)

Which ultraproducts preserve the validity of formulas of higher order logics? To answer this question, we will introduce natural topologies on ultraproducts. We will show, that ultraproducts preserving certain higher order formulas can be characterized in terms of these topologies. As an application of the above results, we provide a constructive, purely model theoretic characterization for classes definable by second order existential formulas.

Some internal and philosophical remarks are made regarding a system of a second order logic of existence axiomatized by the author. Attributes are distinguished in the system according as their possession entails existence or not, The former being called e-Attributes. Some discussion of the special principles assumed for e-Attributes is given as well as of the two notions of identity resulting from such a distinction among attributes. Non-Existing objects are of course indiscernible in terms of e-Attributes. In addition, (...) However, Existing objects indiscernible in terms of e-Attributes are indiscernible in terms of all attributes. (shrink)

The incompleteness of formal systems for arithmetic has been a recognized fact of mathematics. The term “incompleteness” suggests that the formal system in question fails to offer a deduction which it ought to. This chapter focuses on the status of a formal system, Peano Arithmetic, and explores a viewpoint on which Peano Arithmetic occupies an intrinsic, conceptually well-defined region of arithmetical truth. The idea is that it consists of those truths which can be perceived directly from the purely arithmetical (...) content of a categorical conceptual analysis of the notion of natural number. The chapter explores its conceptual stability in light of the apparently destabilizing effect, through extensibility, of the phenomenon of incompleteness. It also offers heuristic and conceptual support for the viewpoint that Peano Arithmetic is the strongest natural first-order system for arithmetic, and that there is a sense in which it is complete with respect to purely arithmetical truth. (shrink)

We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEAT that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality (...) set algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEAT is canonical and atom‐canonical. Imposing an extra condition on T, we prove that atomic algebras in CPEAT are completely representable and that CPEAT has the super amalgamation property. If T is rich and finitely represented, it is shown that CPEAT is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented. (shrink)

This comprehensive volume features the proceedings of the Third International Workshop on Logics for New-Generation Artificial Intelligence and the International Workshop on Logic, AI and Law, held in Hangzhou, China on September 8-9 and 11-12, 2023. The collection offers a diverse range of papers that explore the intersection of logic, artificial intelligence, and law. With contributions from some of the leading experts in the field, this volume provides insights into the latest research and developments (...) in the applications of logic in these areas. It is an essential resource for researchers, practitioners, and students interested in the latest advancements in logic and its applications to artificial intelligence and law. (shrink)

This book constitutes the refereed proceedings of the Third International Workshop on Frontiers of Combining Systems, FroCoS 2000, held in Nancy, France, in March 2000.The 14 revised full papers presented together with four invited papers were carefully reviewed and selected from a total of 31 submissions. Among the topics covered are constraint processing, interval narrowing, rewriting systems, proof planning, sequent calculus, type systems, model checking, theorem proving, declarative programming, logic programming, and equational theories.

We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher-order arithmetic. Let [Formula: see text] be the statement that a non-principal ultrafilter on ℕ exists and let [Formula: see text] be the higher-order extension of ACA0. We show that [Formula: see text] is [Formula: see text]-conservative over [Formula: see text] and thus that [Formula: see text] is conservative over PA. Moreover, we provide a program extraction method and show that from a (...) proof of a strictly [Formula: see text] statement ∀ f ∃ g A qf in [Formula: see text] a realizing term in Gödel's system T can be extracted. This means that one can extract a term t ∈ T, such that ∀ f A qf). (shrink)

This volume contains papers presented at the second international workshop on extensions of logic programming, which was held at the Swedish Institute of Computer Science, Stockhom, January 27-29, 1991. The 12 papers describe and discuss several approaches to extensions of logic programming languages such as PROLOG, as well as connections between logic programming and functional programming, theoretical foundations of extensions, applications, and programming methodologies. The first workshop in this series was held in T}bingen in (...) 1989 and its proceedings areavailable as LNCS 475. The third workshop will be held in Bologna in 1992. (shrink)

Involutive Stone algebras were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued Łukasiewicz–Moisil algebras. In this work we focus on the logic that preserves degrees of truth associated to S-algebras named Six. This follows a very general pattern that can be considered for any class of truth structure endowed with an ordering relation, and which intends to exploit many-valuedness focusing on the notion of inference that results from preserving lower bounds of truth values, (...) and hence not only preserving the value $1$. Among other things, we prove that Six is a many-valued logic that can be determined by a finite number of matrices. Besides, we show that Six is a paraconsistent logic. Moreover, we prove that it is a genuine Logic of Formal Inconsistency with a consistency operator that can be defined in terms of the original set of connectives. Finally, we study the proof theory of Six providing a Gentzen calculus for it, which is sound and complete with respect to the logic. (shrink)

We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on proof terms and equality predicate on terms. Moreover, the completeness theorem and certain generalizations of Stone’s representation theorem are obtained for all proposed algebras.

Many theories of rational belief give a special place to logic. They say that an ideally rational agent would never be uncertain about logical facts. In short: they say that ideal rationality requires "logical omniscience." Here I argue against the view that ideal rationality requires logical omniscience on the grounds that the requirement of logical omniscience can come into conflict with the requirement to proportion one’s beliefs to the evidence. I proceed in two steps. First, I rehearse an influential (...) line of argument from the "higher-order evidence" debate, which purports to show that it would be dogmatic, even for a cognitively infallible agent, to refuse to revise her beliefs about logical matters in response to evidence indicating that those beliefs are irrational. Second, I defend this "anti-dogmatism" argument against two responses put forth by Declan Smithies and David Christensen. Against Smithies’ response, I argue that it leads to irrational self-ascriptions of epistemic luck, and that it obscures the distinction between propositional and doxastic justification. Against Christensen’s response, I argue that it clashes with one of two attractive deontic principles, and that it is extensionally inadequate. Taken together, these criticisms will suggest that the connection between logic and rationality cannot be what it is standardly taken to be—ideal rationality does not require logical omniscience. (shrink)

Includes tutorials, invited lectures, and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. September 2-6, 1996, Bonn, Germany Every four years, the two major international scientific conferences on logic programming merge in one joint event. JICSLP'96 is the thirteenth in the two series of annual conferences sponsored by The Association for Logic Programming. It includes tutorials, invited lectures, and (...) refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. The contributors are international, with strong contingents from the United States, United Kingdom, France, and Japan. Logic Programming series, Research Reports and Notes. (shrink)

Thinking about misleading higher-order evidence naturally leads to a puzzle about epistemic rationality: If one’s total evidence can be radically misleading regarding itself, then two widely-accepted requirements of rationality come into conflict, suggesting that there are rational dilemmas. This paper focuses on an often misunderstood and underexplored response to this (and similar) puzzles, the so-called conflicting-ideals view. Drawing on work from defeasible logic, I propose understanding this view as a move away from the default metaepistemological position according (...) to which rationality requirements are strict and governed by a strong, but never explicitly stated logic, toward the more unconventional view, according to which requirements are defeasible and governed by a comparatively weak logic. When understood this way, the response is not committed to dilemmas. (shrink)

This chapter offers an opinionated introduction to higher-order formal languages with an eye towards their applications in metaphysics. A simply relationally typed higher-order language is introduced in four stages: starting with first-order logic, adding first-order predicate abstraction, generalizing to higher-order predicate abstraction, and finally adding higher-order quantification. It is argued that both β-conversion and Universal Instantiation are valid on the intended interpretation of this language. Given these two principles, it (...) is then shown how we can use pure higher-order logic to ask, and begin to answer, metaphysical questions with non-trivial implications. In particular, while we must reject the popular idea that structural differences between sentences correspond to parallel distinctions in the logical structure of extra-linguistic reality, it may still be possible to give a purely logical characterization of objectual aboutness and related notions. (shrink)

Constraint programming is the fruit of several decades of research carried out in mathematical logic, automated deduction, operations research and arti?cial intelligence. The tools and programming languages arising from this research?eldhaveenjoyedrealsuccessintheindustrialworldastheycontributetosolving hard combinatorial problems in diverse domains such as production planning, communication networks, robotics and bioinformatics. This volume contains the extended and reviewed versions of a selection of papers presented at the Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, which was held from (...) June 30 to July 2, 2003. The venue chosen for the seventh edition of this annual workshop was the Computer and Automation Research Institute of the Hungarian Academy of Sciences in Budapest, Hungary. This institute is one of the 20 members of the Working Group on Constraints of the European Research Consortium for Informatics and Mathematics. For many participants this workshop provided the?rst opportunity to visit their ERCIM partner in Budapest. CoLogNET is the European-funded network of excellence dedicated to s- porting and enhancing cooperation and research on all areas of computational logic, and continues the work done previously by the Compulog Net. In part- ular, the aim of the logic and constraint logic programming area of CoLogNET is to foster and support all research activities related to logic programming and constraint logic programming. The editors would like to take the opportunity and thank all the authors who submitted papers to this volume, as well as the reviewers for their helpful work. (shrink)